Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
نویسنده
چکیده
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Complex Multiplication. Furthermore, we demonstrate the efficiency of the algorithm in practice by giving practical running times. In addition, we present statistics on the number of cryptographically strong elliptic curves of prime order for Optimal Extension Fields of cardinality (2 + c) with c < 0. We conclude that there are sufficiently many curves in this case.
منابع مشابه
On Efficient Pairings on Elliptic Curves over Extension Fields
In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...
متن کاملAlgebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
The elliptic curve discrete logarithm problem is one of the most important problems in cryptography. In recent years, several index calculus algorithms have been introduced for elliptic curves defined over extension fields, but the most important curves in practice, defined over prime fields, have so far appeared immune to these attacks. In this paper we formally generalize previous attacks fro...
متن کاملDistribution of elliptic twins over fixed finite fields: Numerical results
This paper presents the results of numerical experiments to determine the probability, over concrete fixed finite fields, of prime-order elliptic curves having a prime-order twist. These curves are called “elliptic twins” by [7], and are useful for a variety of cryptographic applications. Most notable is that such curves are secure against an “insecure twist” attack. This attack was introduced ...
متن کاملPairing for Elliptic Curves with Embedding Degree 1 Defined over Prime Order Fields
In the last years, prime order pairing-based cryptography has received much attention. The embedding degree 1 is very appealing because the computations can be performed without any extension fields, but the efficiency parameter and this particular value of the embedding degree imposes some limits about the possible curves. This paper presents an analysis of the existing algorithms for construc...
متن کاملOn counting and generating curves over small finite fields
We consider curves defined over small finite fields with points of large prime order over an extension field. Such curves are often referred to as Koblitz curves and are of considerable cryptographic interest. An interesting question is whether such curves are easy to construct as the target point order grows asymptotically. We show that under certain number theoretic conjecture, if q is a prim...
متن کامل